Parallel Performance of Explicit Group Iterative Algorithms on SMP Multiprocessors
نویسندگان
چکیده
s – Contributed Papers 67 CP 4 (Monday 22, 15:45 – 17:15) Room E Optimization Methods and Mathematical Physics 15:45–16:00 Aidawayati Rangkuti Dept. of Math., Faculty of Math. and Natural Sciences, Hasanuddin University, Makassar, Indonesia Title: The Application of Cobb Douglas Function for Solving Linear Programming to analyze its Optimum Abstract: This study attempts to analyze Linear Programming with Cobb Douglas function in solve the use of economic resources owned by Local Transmigrates in South Sulawesi, formulate the optimum use of the resources producing crops. The level of resources used and the economic scale is analyzed by using Cobb Douglas function. Optimization of the use of resources by ratio ( j α ( * y ) j mic x p / ), optimization of crops by Linear Programming. The estimation result of the use of resources indicates a positive and very significant role on production in which the production scale is at the decreasing returns to scale. The optimum profit increases to 801.95 %; 251.96 %; 455.84 %; and 346.67 % at the Transmigration Settlement Units of Lombok I; II; III; Bulukatoang; Timusu; and Pencong respectively. Key-words: Linear Programming, Cobb Douglas Function 16:00–16:15 M. Othman, A.R. Abdullah Department of Communication Technology and Network, University Putra Malaysia, 43400 UPM Serdang, Selangor D.E., Malaysia Department of Industrial Computing, University Kebangsaan Malaysia, 43600 UKM Bangi, Selangor D.E., Malaysia Title: Parallel Performance of Explicit Group Iterative Algorithms on SMP Multiprocessors Abstract: In [2], the modified explicit group method for solving 2D Poisson problem was introduced and it was shown to be the most superior as compared to the explicit decoupled group and explicit group methods. While the parallel version of explicit group, explicit decoupled group and modified explicit group iterative algorithms were implemented successfully, see [1] [3] [4]. In this paper, we will discuss a family of parallel explicit group iterative algorithms which were implemented on the SMP multiprocessors and the performance results were compared in order to show their outstanding performances.
منابع مشابه
A Fast, Parallel Performance of Fourth Order Iterative Algorithm on Shared Memory Multiprocessors (SMP) Architecture
The rotated fourth order iterative algorithm of O(h4) accuracy applied to linear system arising from the discretization of two dimensional Poisson problem was introduced by Othman, et al., 2001 and it was shown to be the fastest as compared to the standard fourth order iterative algorithm, see Gupta, 1984. While the parallel standard fourth order iterative algorithm was implemented successfully...
متن کاملParallel Classification for Data Mining on Shared-Memory Multiprocessors
We present parallel algorithms for building decision-tree classifiers on shared-memory multiprocessor (SMP) systems. The proposed algorithms span the gamut of data and task parallelism. The data parallelism is based on attribute scheduling among processors. This basic scheme is extended with task pipelining and dynamic load balancing to yield faster implementations. The task parallel approach u...
متن کاملAverage-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By modeling parallel algorithms on multiprocessors using task precedence graphs, we are mainly interested in the effects of synchronization overhead and load imbalance on the performance of parallel computations. Thus, we ...
متن کاملAnalytical Method of Performance Prediction in Parallel Algorithms
With the availability of powerful personal computers, workstations and networking devices, the recent trend in parallel computing is to connect a number of individual workstations (PC, PC SMP) to solve computation-intensive tasks in parallel way on such typical clusters as NOW, SMP, Grid). In this sense it is not more true to consider traditionally evolved parallel computing and distributed com...
متن کاملParallel Classiication for Data Mining on Shared-memory Multiprocessors
We present parallel algorithms for building decision-tree classiiers on shared-memory multi-processor (SMP) systems. The proposed algorithms span the gamut of data and task parallelism. The data parallelism is based on attribute scheduling among processors. This basic scheme is extended with task pipelining and dynamic load balancing to yield faster implementations. The task parallel approach u...
متن کامل